Over-approximating reachable tubes of linear time-varying systems

نویسندگان

چکیده

We present a method to over-approximate reachable tubes over compact time-intervals, for linear continuous-time, time-varying control systems whose initial states and inputs are subject convex uncertainty. The uses numerical approximations of transition matrices, is convergent first order, assumes the ability compute with sets in finite dimension. also variant that applies case zonotopic uncertainties, only algebraic operations, yields over-approximations. performance latter demonstrated on an example.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)

This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.

متن کامل

Linear Time - Varying Systems

The notion of properness, well-known for constant linear systems, is generalized to the time-varying case. In a module theoretic framework intrinsic characterizations of input-output system properness are derived. For this, ltrations and the associated Hilbert polyno-mials are used. Classical criteria for properness of polynomial and state representations for constant linear systems are general...

متن کامل

Linear precoding over time-varying channels in TDD systems

Linear transmit filters depend on current channel state information, which is available from the uplink channel estimation in time division duplex systems. For multiple antenna elements at the transmitter, we illustrate the influence of out-dated channel estimates on link level performance for symmetric and asymmetric traffic, comparing the transmit matched, zero-forcing, and Wiener filter. A W...

متن کامل

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automaton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2022

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2021.3057504